SEARCH POPULATION ALGORITHM FOR VLSI ELEMENTS PLACEMENT
نویسندگان
چکیده
منابع مشابه
A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of move...
متن کاملOptimal Placement and Sizing of TCSC & SVC for Improvement Power System Operation using Crow Search Algorithm
Abstract: The need for more efficient power systems has prompted the use of a new technologies includes Flexible AC transmission system (FACTS) devices. FACTS devices provides new opportunity for controlling the line power flow and minimizing losses while maintaining the bus voltages within a permissible limit. In this thesis a new method is proposed for optimal placement and sizing of Thyristo...
متن کاملTemperature Aware Vlsi Placement Algorithm using Genetic Algorithm
Placement is a key step in VLSI physical design cycle. With aggressive scaling if VLSI to Very Deep submicron level lead to higher power density which lead to generation on non uniform thermal map and hotspots. This scenario represent an important challenge in VLSI physical design to generate a layout that distribute temperature uniformly while optimizing traditional metrics like area, power an...
متن کاملVEAP: Global optimization based efficient algorithm for VLSI placement
In this paper we present a very simple, efficient while effective placement algorithm for Row-based VLSIs. This algorithm is based on strict mathematical analysis, and provably can find the global optima. From our experiments, this algorithm is one of the fastest algorithms, especially for very large scale circuits. Another point desired to point out is that our algorithm can be run in both wir...
متن کاملAccelerating Multiobjective VLSI Cell Placement with Parallel Tabu Search
Tabu Search has been successfully used to solve a range of hard optimization problems [1], [2]. In this paper, we present a parallelization of TS to increase efficiency of solving the constrained multiobjective VLSI standard cell placement problem. Acceleration of search to decrease runtime requirements of large circuits is investigated and other proposals in literature are experimented with. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IZVESTIYA SFedU. ENGINEERING SCIENCES
سال: 2020
ISSN: 1999-9429,2311-3103
DOI: 10.18522/2311-3103-2020-4-125-136